Computing hypercircles by moving hyperplanes
نویسندگان
چکیده
منابع مشابه
Computing hypercircles by moving hyperplanes
Let K be a field of characteristic zero, α algebraic of degree n over K. Given a proper parametrization ψ of a rational curve C, we present a new algorithm to compute the hypercircle associated to the parametrization ψ. As a consequence, we can decide if C is defined over K and, if not, to compute the minimum field of definition of C containing K. The algorithm exploits the conjugate curves of ...
متن کاملOnline Clustering of Moving Hyperplanes
We propose a recursive algorithm for clustering trajectories lying in multiple moving hyperplanes. Starting from a given or random initial condition, we use normalized gradient descent to update the coefficients of a time varying polynomial whose degree is the number of hyperplanes and whose derivatives at a trajectory give an estimate of the vector normal to the hyperplane containing that traj...
متن کاملBayes Optimal Hyperplanes! Maximal Margin Hyperplanes
Maximal margin classifiers are a core technology in modern machine learning. They have strong theoretical justifications and have shown empirical successes. We provide an alternative justification for maximal margin hyperplane classifiers by relating them to Bayes optimal classifiers that use Parzen windows estimations with Gaussian kernels. For any value of the smoothing parameter (the width o...
متن کاملSearching for Features Defined by Hyperplanes
We consider decision tables with real value conditional attributes and we present a method for extraction of features deened by hyperplanes in a multi-dimensional aane space. These new features are often more relevant for object classiication than the features deened by hyperplanes parallel to axes. The method generalizes an approach presented in 18] in case of hyperplanes not necessarily paral...
متن کاملSeparating Points by Parallel Hyperplanes - Characterization Problem
This paper deals with partitions of a discrete set S of points in a d-dimensional space, by h parallel hyperplanes. Such partitions are in a direct correspondence with multilinear threshold functions which appear in the theory of neural networks and multivalued logic. The characterization (encoding) problem is studied. We show that a unique characterization (encoding) of such multilinear partit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2013
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2012.09.001